Variable Neighborhood Search Methods for the Dynamic Minimum Cost Hybrid Berth Allocation Problem

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Variable neighborhood search for minimum cost berth allocation

The berth allocation problem is to allocate space along the quayside to incoming ships at a container terminal in order to minimize some objective function. We consider minimization of total costs for waiting and handling as well as earliness or tardiness of completion, for all ships. We assume ships can arrive at any given time, i.e., before or after the berths become available. The resulting ...

متن کامل

Variable Neighborhood Search for the Minimum Interference Frequency Assignment Problem

The frequency assignment is an important task in the design of radio network. Let us concider a GSM network N composed of a set of nc cells: C= {C1, C2 . . . Ci, . . . Cnc}. Each cell required a number of frequencies which is defined by the number of transceivers TRX or traffic demand Di= {1, 2 . . . , x}An interval of operational frequencies: [Fmax − Fmin]. Further, consider a matrix: MCo[nc][...

متن کامل

Models and Tabu Search Heuristics for the Berth-Allocation Problem

In the Berth Allocation Problem (BAP) the aim is to optimally schedule and assign ships to berthing areas along a quay. The objective is the minimization of the total (weighted) service time for all ships, defined as the time elapsed between the arrival in the harbor and the completion of handling. Two versions of the BAP are considered: the discrete case and the continuous case. The discrete c...

متن کامل

Variable Neighborhood Search Methods

Main methods, algorithms and applications of the Variable Neighborhood Search metaheuristic are surveyed, in view of a chapter of the Encyclopedia of Optimization.

متن کامل

A Hybrid Column Generation Approach for the Berth Allocation Problem

The Berth Allocation Problem (BAP) consists on programming and allocating ships to berthing areas along a quay. The BAP is modeled as a vehicle routing problem and a recently proposed evolutionary hybrid method denominated PTA/LP is used to solve it. The PTA/LP combines the Population Training Algorithm with Linear Programming to generate improving incoming columns in a column generation proces...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information Technology And Control

سال: 2018

ISSN: 2335-884X,1392-124X

DOI: 10.5755/j01.itc.47.3.20420